منابع مشابه
Optimal Global Instruction Scheduling Using Enumeration
Instruction scheduling is one of the most important compiler optimizations. An instruction scheduler reorders instructions to improve performance by minimizing pipeline stalls. Traditional approaches to instruction scheduling were based on heuristics. Over the past decade, however, a number of researchers have proposed optimal solutions to instruction scheduling. This dissertation presents the ...
متن کاملOptimal Factory Scheduling using Stm
Generating optimal production schedules for manufacturing facilities is an area of great theoretical and practical importance. During the last decade, an effort has been made to reconcile the techniques developed by the AI and OR communities. The work described here aims to continue in this vein by showing how a class of well-defined stochastic scheduling problems can be mapped into a general s...
متن کاملToward Optimal Motif Enumeration
We present algorithms that reduce the time and space needed to solve problems of finding all motifs common to a set of sequences. In particular, we give algorithms that (1) require time and space linear in the size of the input, (2) succinctly encode the output so that the time and space requirements depend on the number of motifs, not directly on motif length, and (3) efficiently parallelize t...
متن کاملOptimal Factory Scheduling using Stochastic Dominance A*
We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule. The SDA * (Stochastic Dominance A*) algo rithm remedies this d...
متن کاملOptimal Scheduling Using Constraint Logic Programming
In this paper a methodology to solve scheduling applications (e.g. job-shop) using constraint logic programming (CLP) is presented. Firstly, the CLP problem definition is briefly described. Secondly, a new strategy for finding optimal solution is presented. New strategy consists of three steps. (1) A heuristic capable to find an initial solution of good quality very quickly (upper bound). (2) A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2009
ISSN: 1544-3566,1544-3973
DOI: 10.1145/1498690.1498694